Fractional Fourier transform and chaos functions play a key role in many ofencryption-decryption algorithms. In this work performance of imageencryption-decryption algorithms is quantified and compared using thecomputation time i.e. the time consumption of encryption-decryption process andresemblance of input image to the restored image, quantified by MSE. This workproposes an improvement in computation-time of image encryptiondecryptionalgorithms by utilizing image compression properties of the 2-dimensionalDiscrete Wavelet Transform (DWT2). Initially, computation complexity of thealgorithms is evaluated and compared with that of existing algorithms. Thisanalysis claims the proposed algorithms to be nearly 8 times faster than theexisting algorithms. Further, simulations are performed using MATLAB7.7 toquantify performance of existing algorithms and the proposed algorithms usingMSE and computation time. The results obtained in these simulations prove thatfor the proposed algorithms MSE between restored and original images is lesserthan that of existing algorithms thereby maintaining the robustness of theexisting algorithms. These algorithms are found sensitive to a variation of1x10-1 in the fractional orders used in encryption-decryption process.
展开▼
